Scheduling Jobs Using Common Resources
نویسندگان
چکیده
This paper examines the problem of distributed resource allocation in different models of computation and communication in distributed systems, and presents a number of time optimal (randomized and deterministic) allocation algorithms. We consider the dining drinking philosophers problem as presented in [B. Awerbuch and M. Saks, in ``FOCS,'' pp. 65 74. IEEE, New York, 1990]. In the algorithm presented in that paper, the delay from the creation of a job to the time it started executing depends quadratically on the number of jobs conflicting with it. In this paper we improve this result by presenting an algorithm for which the dependence becomes linear, which is optimal. ] 1996 Academic Press, Inc.
منابع مشابه
A New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملEfficient Job Scheduling on Computational Grid with Differential Evolution Algorithm
Grid computing refers to the combination of computer resources from multiple administrative domains to reach common goal. Grids offer a way of using the information technology resources optimally inside an organization. Grid environments facilitate distributed computation. Hence the scheduling of grid jobs should be considered as an important issue. This paper introduces a novel approach based ...
متن کاملOptimizing Grid Scheduling Based on Local Cluster Scheduling Policies and Resource Availability
on the common paradigm of treating clusters as separate administrative domains. Clusters are grouped to form grids which participate in Virtual Organizations (VO) and share resources to meet common computing goals. Each cluster is a separate administrative domain and can choose to be a part of many VOs. Because of the nature of a VO, a cluster typically gives a higher preference to scheduling j...
متن کاملRepresenting Job Scheduling for Volunteer Grid En- vironment using Online Container Stowage
Volunteer grid computing comprises of volunteer resources which are unpredictable in nature and as such the scheduling of jobs among these resources could be very uncertain. It is also difficult to ensure the successful completion of submitted jobs on volunteer resources as these resources may opt to withdraw from the grid system anytime or there might be a resource failure, which requires job ...
متن کاملEvaluating Heuristics for Scheduling Dependent Jobs in Grid Computing Environments
Job scheduling plays a critical role in the utilisation of grid resources by mapping a number of jobs to grid resources. However, the heterogeneity of grid resources adds some challenges to the work of job scheduling, especially when jobs have dependencies which can be represented as Direct Acyclic Graphs (DAGs). It is widely recognised that scheduling m jobs to n resources with an objective to...
متن کاملScheduling Independent Jobs on Computational Grid using Biogeography Based Optimization Algorithm for Makespan Reduction
Due to the development of information and network technologies, idle computers all over the world can be organized and utilized to enhance the overall computation performance. Grid computing refers to the combination of computer resources from multiple administrative domains used to reach a common goal. Grids offer a way of using the information technology resources optimally inside an organiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 125 شماره
صفحات -
تاریخ انتشار 1996